A Comparison of Decoding Latency for Block and Convolutional Codes⋆
نویسندگان
چکیده
In this paper we compare the decoding latency, i.e., the delay between the time a channel symbol is received and the time it is decoded, of block and convolutional codes. In particular, we compare low density parity check (LDPC) block codes with iterative message-passing decoding to convolutional codes with Viterbi decoding and stack sequential decoding. On the basis of simulations, we show that, for a code rate of 1/2, a target bit error rate of 10, and an allowed latency of up to approximately 2000 information bits, convolutional codes with stack sequential decoding require a smaller signal-to-noise ratio (SNR) than LDPC codes with iterative message-passing decoding. For larger allowed latencies, the advantage switches to LDPC codes.
منابع مشابه
تجزیه و تحلیل عملکرد کدهای کانولوشنال تعریف شده در میدان حقیقی در کانال فیدینگ و در حضور نویز کوانتیزاسیون
Channel coding is one of the techniques used for suppression of fading and channel noise effects. Most of the researches on channel codes have been focused on the codes which are defined on Galois fields. Since two decades ago, using channel codes defined on Real and Complex fields has been considered for joint sourcechannel coding in multimedia transmission; but most of the works have focused ...
متن کاملA Comparison Between LDPC Block and Convolutional Codes
LDPC convolutional codes have been shown to be capable of achieving the same capacity-approaching performance as LDPC block codes with iterative message-passing decoding. However, traditional means of comparing block and convolutional codes tied to the implementation complexity of trellisbased decoding are irrelevant for message-passing decoders. In this paper, we undertake a comparison of LDPC...
متن کاملDecoding LDPC Convolutional Codes on Markov Channels
This paper describes a pipelined iterative technique for joint decoding and channel state estimation of LDPC convolutional codes over Markov channels. Example designs are presented for the Gilbert-Elliott discrete channel model. We also compare the performance and complexity of our algorithm against joint decoding and state estimation of conventional LDPC block codes. Complexity analysis reveal...
متن کاملPerformance Comparison of LDPC Block and Spatially Coupled Codes over GF(q)
In this paper, we compare the finite-length performance of protograph-based spatially coupled lowdensity parity-check (SC-LDPC) codes and LDPC block codes (LDPC-BCs) over GF(q). In order to reduce computational complexity and latency, a sliding window decoder with a stopping rule based on a soft bit-error-rate (BER) estimate is used for the q-ary SC-LDPC codes. Two regimes are considered: one w...
متن کاملAlgebraic decoding for doubly cyclic convolutional codes
An iterative decoding algorithm for convolutional codes is presented. It successively processes N consecutive blocks of the received word in order to decode the first block. A bound is presented showing which error configurations can be corrected. The algorithm can be efficiently used on a particular class of convolutional codes, known as doubly cyclic convolutional codes. Due to their highly a...
متن کامل